New Dynamic Load Balancing Strategy for E cientData - Parallel
نویسندگان
چکیده
The rendering of realistic images requires a precise treatment of lighting eeects by simulating the underlying physical phenomena of light emission, propagation, and reeection. The radios-ity method is widely used for computing such global illumination eeects in image synthesis applications. Dueto the extensive computational demands and the enormous memory requirements of this method, an eecient data-parallel radiosity algorithm is needed. Dynamic load balancing techniques are the most critical part of an eecient implementation of parallel algorithms on distributed computing systems. In this paper a new dynamic load balancing strategy is proposed which increase the eeciency of a previously introduced data-parallel progressive reene-ment radiosity method.
منابع مشابه
Parleda: a Library for Parallel Processing in Computational Geometry Applications
ParLeda is a software library that provides the basic primitives needed for parallel implementation of computational geometry applications. It can also be used in implementing a parallel application that uses geometric data structures. The parallel model that we use is based on a new heterogeneous parallel model named HBSP, which is based on BSP and is introduced here. ParLeda uses two main lib...
متن کاملAn Incremental Parallel Scheduling Approach to Solving Dynamic and Irregular Problems
|Global parallel scheduling is a new approach for runtime load balancing. In parallel scheduling , all processors are cooperated together to schedule work. Parallel scheduling accurately balances the load by using global load information. As an alternative strategy to the commonly used dynamic scheduling, it provides a high-quality, low-overhead load balancing. This paper presents a parallel sc...
متن کاملA Distributed Dynamic Load Balancing Strategy Based on Rate of Change
Dynamic Load Balancing is an important system function destined to distribute workload among available processors to speed up the execution of computer programs whose workload varies at run-time in unpredictable ways. The non-uniform computation and communication requirements may bog down a parallel computer if no e cient load distribution is e ected. A novel distributed algorithm for load bala...
متن کاملLoad balancing of irregular parallel divide-and-conquer algorithms in group-SPMD programming environments
We study strategies for local load balancing of irregular parallel divide-andconquer algorithms such as Quicksort and Quickhull in SPMD-parallel environments such as MPI and Fork that allow to exploit nested parallelism by dynamic group splitting. We propose two new local strategies, repivoting and serialisation, and develop a hybrid local load balancing strategy, which is calibrated by paramet...
متن کاملDynamic Load Balancing for Parallel Finite Element Methods with Adaptive h-and p-Refinement
We describe a dynamic load-balancing strategy for parallel finite element methods with adaptive mesh (h-) and order (p-) refinement. The load-balancing algorithm is based on the tiling load-balancing system, where global balance is achieved by performing local balancing within overlapping neighborhoods of processors. Tiling is applied to each mesh level created by the adaptive h-refinement. Wei...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1999